Orientation, simplicity, and inclusion test for planar polygons

نویسندگان

  • Francisco R. Feito-Higueruela
  • Juan Carlos Torres
  • A. Ureña
چکیده

Closure: Every segment must be delimited by exactly two vertices, and every vertex must be at the intersection of exactly two segments. (Fig. la) No self-intersection: Any two segments can intersect only if they are adjacent, in this case the intersection point is the shared vertex (Fig. lb). Orientation: Every segment must have a direction, and the directions of all the segments must be consistent (Fig. Ic).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of the Kinematic Sensitivity and the Greatest Continuous Circle in the Constant-orientation Workspace of Planar Parallel Mechanisms

This paper presents the results of a comprehensive study on the efficiency of planar parallel mechanisms, considering their kinetostatic performance and also, their workspace. This aim is approached upon proceeding single- and multi-objective optimization procedures. Kinetostatic performances of ten different planar parallel mechanisms are analyzed by resorting to a recent index, kinematic sens...

متن کامل

Detecting Weakly Simple Polygons

5 A closed curve in the plane is weakly simple if it is the limit (in the Fréchet metric) 6 of a sequence of simple closed curves. We describe an algorithm to determine whether 7 a closed walk of length n in a simple plane graph is weakly simple in O(n log n) time, 8 improving an earlier O(n3)-time algorithm of Cortese et al. [Discrete Math. 2009]. As 9 an immediate corollary, we obtain the fir...

متن کامل

Linear-Time Algorithms for Rectilinear Hole-free Proportional Contact Representations

A proportional contact representation of a planar graph is one where each vertex is represented by a simple polygon with area proportional to a given weight and adjacencies between polygons represent edges between the corresponding pairs of vertices. In this paper we study proportional contact representations that use only rectilinear polygons and contain no unused area or hole. There is an alg...

متن کامل

Linear - Time Algorithms for Proportional Contact Graph Representations ?

In a proportional contact representation of a planar graph, each vertex is represented by a simple polygon with area proportional to a given weight, and edges are represented by adjacencies between the corresponding pairs of polygons. In this paper we study proportional contact representations that use rectilinear polygons without wasted areas (white space). In this setting, the best known algo...

متن کامل

Surface segmentation and modeling of 3D polygonal objects from stereoscopic image pairs

An approach to automatically generate 3–D polygonal models from stereoscopic image pairs of piecewise planar objects is presented. Dense disparity maps are computed by constrained epipolar block matching. Local surface orientations are computed from the quantized disparity map using a spline approximation under explicit consideration of quantization noise. The local surface orientation is then ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Graphics

دوره 19  شماره 

صفحات  -

تاریخ انتشار 1995